Multiple access channels with arbitrarily correlated sources

Manuscript received November 28, 1978; revised February 28, 1980. This work was supported in part by the National Science Foundation under Grant ENG 76-23334, in part by the Stanford Research Institute under International Contract D/&C-15-C-0187, and in part by the Joint Scientific Enaineerina Program under Contracts NO001475-C-0601 and F44620-76-C&01. This paper was presented at the 1979 IEEE Intemational Symposium on Information Theory, Grignano, Italy, June 25-29, 1979. T. M. Cover is with the Departments of Electrical Engineering and Statistics, Stanford University, Durand Building, Room 121, Stanford, CA 94305. A. El Gamal was with the Department of Electrical Engineering, University of Southern California, University Park, Los Angeles, CA. He is now with the Department of Electrical Engineering, Stanford University, Stanford, CA 94305. M. Salehi was with the Department of Electrical Engineering, Stanford University, Stanford, CA. He is now with the Department of Electrical Engineering, University of Isfahan, Isfahan, Iran. and I’ can be sent over the multiple access channel if, for some AxI, ~~)=Ax&(x2)~ H(U)<Z(X,; YIX,),